SIRKUIT HAMILTON DALAM PERMAINAN CONGKLAK

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research of Driving Circuit in Coaxial Induction Coilgun

Catu daya merupakan peralatan penting dalam peluncur kumparan induksi koaksial. Konfigurasi rangkaian pengemudi mempengaruhi secara langsung efisiensi peluncur kumparan. Makalah ini memberikan analisis rinci tentang sifat konstruksi rangkaian pengemudi berbasis sumber kapasitor. Tiga topologi dari rangkaian pengemudi dibandingkan, meliputi rangkaian osilasi, crowbar dan setengah gelombang. Hal ...

متن کامل

Pengembangan Sistem Penciuman Elektronik Dalam Mengenal Aroma Campuran

C-BLAST system is detection algorithm of the MIMO (Multplei-Input Multiple Output) systems that is designed to achieve good multiplexing gain. In the C-BLAST systems, every antenna transmits has its own independently coded with power control. In this paper we use MMSE (Minimum Mean Square Error) detection to achieve the performance of error rate for the C-BLAST systems. Simulation results show ...

متن کامل

Trinity Hamilton

The metalloenzyme nitrogenase is utilized by microbial diazotrophs to accomplish the majority of biological nitrogen fixation. Many different forms of the enzyme nitrogenase are known to exist. They are categorized by the type of metal cluster providing the N2-binding site, which is also the active site of the enzyme. The nitrogenase best-characterized to date has an active site with the compos...

متن کامل

M-alternating Hamilton paths and M-alternating Hamilton cycles

We study M-alternating Hamilton paths, and M-alternating Hamilton cycles in a simple connected graph G on ν vertices with a perfect matchingM . Let G be a bipartite graph, we prove that if for any two vertices x and y in different parts of G, d(x)+d(y) ≥ ν/2+2, then G has an M-alternating Hamilton cycle. For general graphs, a condition for the existence of an M-alternating Hamilton path startin...

متن کامل

Packing Hamilton Cycles Online

It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge disjoint Hamilton cycles, [4], [13], [9]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ≥ 2, if random edges of Kn are presented one by one then w.h.p. it is possible to color the edges online with σ color...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AdMathEdu : Jurnal Ilmiah Pendidikan Matematika, Ilmu Matematika dan Matematika Terapan

سال: 2017

ISSN: 2088-687X

DOI: 10.12928/admathedu.v7i1.7400